t = int(input())
for i in range(t):
n, r, b = map(int, input().split())
b+=1
x = r//b
y = r%b
ans = ""
for j in range(y):
ans+=(x+1)*"R"+"B"
for j in range(b-y):
ans+=x*"R"+"B"
ans = ans[:-1]
print(ans)#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll ;
typedef unsigned long long ull;
typedef pair<int,int>PII;
const int N = 2e5 + 5;
// int a[N],n;
bool st[N];
void solve()
{
int n,r,b;
cin>>n>>r>>b;
int a = b + 1;
int p = (r + a - 1)/ a;
string s;
int t = 0;
for(int i = 1;i <= n;){
while(t < p && r)s += 'R',r--,t++,++i;
if(i > n)break;
a--;
p = (r + a - 1) / a;
s+='B';
t = 0;
++i;
}
cout<<s<<"\n";
}
signed main()
{
std::cin.tie(nullptr),std::cout.tie(nullptr)->std::ios::sync_with_stdio(false);
int T = 1;
cin>>T;
while(T--)solve();
return 0;
}112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |